A modified homogeneous algorithm for function minimization
نویسندگان
چکیده
منابع مشابه
A stochastic algorithm for function minimization
Focusing on what an optimization problem may comply with, the so-called convergence conditions have been proposed and sequentially a stochastic optimization algorithm named as DSZ algorithm is presented in order to deal with both unconstrained and constrained optimizations. Its principle is discussed in the theoretical model of DSZ algorithm, from which we present a practical model of DSZ algor...
متن کاملA New Algorithm for Performance Evaluation of Homogeneous Architectural Styles
Software architecture is considered one of the most important indices of software engineering today. Software Architecture is a technical description of a system indicating its component structures and their relationships, and is the principles and rules governing designing. The success of the software depends on whether the system can satisfy the quality attributes. One of the most critical as...
متن کاملA New Algorithm for Performance Evaluation of Homogeneous Architectural Styles
Software architecture is considered one of the most important indices of software engineering today. Software Architecture is a technical description of a system indicating its component structures and their relationships, and is the principles and rules governing designing. The success of the software depends on whether the system can satisfy the quality attributes. One of the most critical as...
متن کاملA Modified Penalty Function Method for Inequality Constraints Minimization
In this paper we introduce a modified penalty function (MPF) method for solving a problem which minimizes a nonlinear programming subject to inequality constraints. Basically, this method is a combination of the modified penalty methods and the Lagrangian methods. It treats inequality constraints with a modified penalty function and avoids the indifferentiability of max {x, 0}. This method alte...
متن کاملA Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
We consider the problem of minimizing a submodular function f defined on a set V with n elements. We give a combinatorial algorithm that runs in O(n EO + n) time, where EO is the time to evaluate f(S) for some S ⊆ V. This improves the previous best strongly polynomial running time by more than a factor of n
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1974
ISSN: 0022-247X
DOI: 10.1016/0022-247x(74)90259-5